Complementarity of Feature Point Detectors
نویسندگان
چکیده
The goal of this paper is to provide a study on complementarity of feature point detectors. Many studies have been proposed on these detectors but none deals with complementarity in details. We introduce an evaluation of eleven well-known detectors based on new criteria used to characterize complementarity. The complementarity is computed with spatial distribution and contribution measures as well as repeatability and distribution gains of the association of two detectors.
منابع مشابه
Measuring the Coverage of Interest Point Detectors
Repeatability is widely used as an indicator of the performance of an image feature detector but, although useful, it does not convey all the information that is required to describe performance. This paper explores the spatial distribution of interest points as an alternative indicator of performance, presenting a metric that is shown to concur with visual assessments. This metric is then exte...
متن کاملAdaptive and Optimal Combination of Local Features for Image Retrieval
With the large number of local feature detectors and descriptors in the literature of Content-Based Image Retrieval (CBIR), in this work we propose a solution to predict the optimal combination of features, for improving image retrieval performances, based on the spatial complementarity of interest point detectors. We review several complementarity criteria of detectors and employ them in a reg...
متن کاملRapid Online Analysis of Local Feature Detectors and Their Complementarity
A vision system that can assess its own performance and take appropriate actions online to maximize its effectiveness would be a step towards achieving the long-cherished goal of imitating humans. This paper proposes a method for performing an online performance analysis of local feature detectors, the primary stage of many practical vision systems. It advocates the spatial distribution of loca...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملA full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کامل